Coverage Enhancement Of Average Distance Based Self-Relocation Algorithm Using Augmented Lagrange Optimization
نویسندگان
چکیده
منابع مشابه
Coverage Enhancement of Average Distance Based Self-relocation Algorithm Using Augmented Lagrange Optimization
Mobile robots with sensors installed on them are used in wireless sensor networks to generate information about the area. These mobile robotic sensors have to relocate themselves after initial location in the field to gain maximum coverage The average distance based algorithm for relocation process of mobile sensors does not require any GPS system for tracking the robotic sensors, thus avoiding...
متن کاملOptimization of Average Distance Based Self-relocation Algorithm Using Augmented Lagrangian Method
Mobile robots with sensors installed on them are used in wireless sensor networks to generate information about the area. These mobile robotic sensors have to relocate themselves after initial location in the field to gain maximum coverage The average distance based algorithm for relocation process of mobile sensors does not require any GPS system for tracking the robotic sensors, thus avoiding...
متن کاملSolving Combinatorial Optimization Problems Using Augmented Lagrange Chaotic Simulated Annealing
Chaotic simulated annealing (CSA) proposed by Chen and Aihara has been successfully used to solve a variety of combinatorial optimization problems. CSA uses a penalty term to enforce solution validity as in the original Hopfield-Tank approach. There exists a conflict between solution quality and solution validity in the penalty approach. It is often difficult to adjust the relative magnitude of...
متن کاملRelaxation labeling using augmented lagrange-hopfield method
A novel relaxation labeling (RL) method is presented based on Augmented Lagrangian multipliers and the graded Hoppeld neural network (ALH). In this method, an RL problem is converted into a constrained optimization problem and solved by using the augmented Lagrangian and Hoppeld techniques. The ALH method yields results comparable to the best of the existing RL algorithms in terms of the optimi...
متن کاملDynamic Multiobjective Optimization Algorithm Based on Average Distance Linear Prediction Model
Many real-world optimization problems involve objectives, constraints, and parameters which constantly change with time. Optimization in a changing environment is a challenging task, especially when multiple objectives are required to be optimized simultaneously. Nowadays the common way to solve dynamic multiobjective optimization problems (DMOPs) is to utilize history information to guide futu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Next-Generation Networks
سال: 2015
ISSN: 0975-7252,0975-7023
DOI: 10.5121/ijngn.2015.7302